skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Troupe, Lee"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; (, Proceedings of the American Mathematical Society)
    Let s ( n ) = ∑ d ∣ n ,   d > n d s(n)=\sum _{d\mid n,~d>n} d denote the sum of the proper divisors of n n . The second-named author proved that ω ( s ( n ) ) \omega (s(n)) has normal order log ⁡ log ⁡ n \log \log {n} , the analogue for s s -values of a classical result of Hardy and Ramanujan [ The normal number of prime factors of a number n [Quart. J. Math. 48 (1917), 76–92], AMS Chelsea Publ., Providence, RI, 2000, pp. 262–275]. We establish the corresponding Erdős–Kac theorem: ω ( s ( n ) ) \omega (s(n)) is asymptotically normally distributed with mean and variance log ⁡ log ⁡ n \log \log {n} . The same method applies with s ( n ) s(n) replaced by any of several other unconventional arithmetic functions, such as β ( n ) ≔ ∑ p ∣ n p \beta (n)≔\sum _{p\mid n} p , n − φ ( n ) n-\varphi (n) , and n + τ ( n ) n+\tau (n) ( τ \tau being the divisor function). 
    more » « less
    Full Text Available